Ultrametric Distance in Syntax
نویسنده
چکیده
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which is much simpler as the branching structure is more readily discernible and switched. The occurrence of hierarchical structure elsewhere in linguistics is mentioned. The phrase tree can be represented by a matrix and the elements of the matrix can be represented by triangles. The height at which branching occurs is not prescribed in previous syntactic models, but it is by using the ultrametric matrix. In other words the ultrametric approach gives a complete description of phrase trees, unlike previous approaches. The ambiguity of which branching height to choose, is resolved by postulating that branching occurs at the lowest height available. An ultrametric produces a measure of the complexity of sentences: presumably the complexity of sentences increases as a language is acquired so that this can be tested. All ultrametric triangles are equilateral or isosceles. Here it is shown that X̄ structure implies that there are no equilateral triangles. Restricting attention to simple syntax a minimum ultrametric distance between lexical categories is calculated. A matrix constructed from this ultrametric distance is shown to be different than the matrix obtained from features. It is shown that the definition of c-command can be replaced by an equivalent ultrametric definition. The new definition invokes a minimum distance between nodes and this is more aesthetically satisfying than previous varieties of definitions. From the new definition of c-command follows a new definition of of the central notion in syntax namely government.
منابع مشابه
Generalized Ultrametric Semilattices of Linear Signals
We consider certain spaces of linear signals equipped with a standard prefix relation and a suitably defined generalized distance function. We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and prove a representation theorem stating that every generalized ultrametric semilattice with a totally ordered distance set is isomorphic to a space of th...
متن کاملUltrametrics in the genetic code and the genome
Ultrametric approach to the genetic code and the genome is considered and developed. p-Adic degeneracy of the genetic code is pointed out. Ultrametric tree of the codon space is presented. It is shown that codons and amino acids can be treated as p-adic ultrametric networks. Ultrametric modification of the Hamming distance is defined and noted how it can be useful. Ultrametric approach with p-a...
متن کاملExistentially equivalent cyclic ultrametric spaces and cyclically valued groups
The notions of ultrametric distances and cyclic valuations appear when the set of values of the distance map is a cyclically ordered set. These structures can be described as subspaces of cartesian products. In this paper we characterize existentially equivalence between cyclically ultrametric spaces, as well as existentially equivalence between generalized ultrametric spaces. We also describe ...
متن کاملReconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted phylogenetic tree that satisfies M, if one exists. We study some extensions of this problem to rooted phylogenetic networks. Our main result is an O(n(2) log n)-time algorithm for determining whether there is an ultrametric galled...
متن کاملUltrametric Spaces in Continuous Logic
We investigate the continuous model theory of ultrametric spaces of diameter ≤ 1. There is no universal Polish ultrametric space of diameter 1; but there is a Polish ultrametric space, Umax, taking distances in Q∩[0, 1], which is universal for all such Polish ultrametric spaces. We show that in the continuous theory of Umax, nonforking is characterized by a stable independence relation, which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CL/9810012 شماره
صفحات -
تاریخ انتشار 1998